Efficient Construction, Update and Downdate Of The Coefficients Of Interpolants Based On Polynomials Satisfying A Three-Term Recurrence Relation

نویسنده

  • Pedro Gonnet
چکیده

In this paper, we consider methods to compute the coefficients of interpolants relative to a basis of polynomials satisfying a three-term recurrence relation. Two new algorithms are presented: the first constructs the coefficients of the interpolation incrementally and can be used to update the coefficients whenever a nodes is added to or removed from the interpolation. The second algorithm, which constructs the interpolation coefficients by decomposing the Vandermonde-like matrix iteratively, can not be used to update or downdate an interpolation, yet is more numerically stable than the first algorithm and is more efficient when the coefficients of multiple interpolations are to be computed over the same set of nodes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ORTHOGONAL ZERO INTERPOLANTS AND APPLICATIONS

Orthogonal zero interpolants (OZI) are polynomials which interpolate the “zero-function” at a finite number of pre-assigned nodes and satisfy orthogonality condition. OZI’s can be constructed by the 3-term recurrence relation. These interpolants are found useful in the solution of constrained approximation problems and in the structure of Gauss-type quadrature rules. We present some theoretical...

متن کامل

Approximation by Baskakov quasi-interpolants

Baskakov operators and their inverses can be expressed as linear differential operators on polynomials. Recurrence relations are given for the computation of these coefficients. They allow the construction of the associated Baskakov quasi-interpolants (abbr. QIs). Then asymptotic results are provided for the determination of the convergence orders of these new quasi-interpolants. Finally some r...

متن کامل

0 v 1 [ m at h . C A ] 5 O ct 1 99 3 ORTHOGONAL MATRIX POLYNOMIALS AND HIGHER ORDER RECURRENCE RELATIONS

Abstract. It is well-known that orthogonal polynomials on the real line satisfy a three-term recurrence relation and conversely every system of polynomials satisfying a three-term recurrence relation is orthogonal with respect to some positive Borel measure on the real line. In this paper we extend this result and show that every system of polynomials satisfying some (2N + 1)-term recurrence re...

متن کامل

Turán Inequalities and Zeros of Orthogonal Polynomial

We use Turán type inequalities to give new non-asymptotic bounds on the extreme zeros of orthogonal polynomials in terms of the coefficients of their three term recurrence. Most of our results deal with symmetric polynomials satisfying the three term recurrence pk+1 = xpk − ckpk−1, with a nondecreasing sequence {ck}. As a special case they include a non-asymptotic version of Máté, Nevai and Tot...

متن کامل

Turán Inequalities and Zeros of Orthogonal Polynomials∗

We use Turán type inequalities to give new non-asymptotic bounds on the extreme zeros of orthogonal polynomials in terms of the coefficients of their three term recurrence. Most of our results deal with symmetric polynomials satisfying the three term recurrence pk+1 = xpk − ckpk−1, with a nondecreasing sequence {ck}. As a special case they include a non-asymptotic version of Máté, Nevai and Tot...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1003.4628  شماره 

صفحات  -

تاریخ انتشار 2010